Binomial-coefficient Multiples of Irrationals

نویسنده

  • Terrence M. Adams
چکیده

Denote by x a random infinite path in the graph of Pascal’s triangle (left and right turns are selected independently with fixed probabilities) and by dn(x) the binomial coefficient at the n’th level along the path x. Then for a dense Gδ set of θ in the unit interval, {dn(x)θ} is almost surely dense but not uniformly distributed modulo 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BINOMIAL - COEFFICIENT MULTIPLES OF IRRATIONALSTerrence

Denote by x a random innnite path in the graph of Pascal's triangle (left and right turns are selected independently with xed probabilities) and by d n (x) the binomial coeecient at the n'th level along the path x. Then for a dense G set of in the unit interval, fd n (x)g is almost surely dense but not uniformly distributed modulo 1.

متن کامل

Comparison of five introduced confidence intervals for the binomial proportion

So far many confidence intervals were introduced for the binomial proportion. In this paper, our purpose is comparing five well known based on their exact confidence coefficient and average coverage probability.

متن کامل

The Negative q-Binomial

Interpretations for the q-binomial coefficient evaluated at −q are discussed. A (q, t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces. 1. The q-binomial The q-binomial coefficient is defined for integers k and n, with 0 ≤ k ≤ n, and an indeterminate q by

متن کامل

Combinatorial Proofs of Some Moriarty-type Binomial Coefficient Identities

In this note, we present combinatorial proofs of some Moriarty-type binomial coefficient identities using linear and circular domino arrangements.

متن کامل

Approximation of Irrationals 305 Definition

The author uses a new modification of Jacobi-Perron Algorithm which holds for complex fields of any degree (abbr. ACF), and defines it as Generalized Euclidean Algorithm (abbr. GEA) to approximate irrationals. This paper deals with approximation of irrationals of degree n 2,3,5. Though approximations of these irrationals in a variety of patterns are known, the results are new and practical, sin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998